An algorithm to generate exactly once every tiling with lozenges of a domain

We first show that the tilings of a domain D form a lattice (using the same kind of arguments as in [Rém99]) which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We show that general domains can be broken up into hexagon-like parts. Finally we give an algorithm to generate exactly once every element in the lattice of the tilings of a general domain D.